On Preconditioning Schur Complement and Schur Complement Preconditioning
نویسنده
چکیده
We study two implementation strategies to utilize Schur complement technique in multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. The first strategy constructs a RILUM to precondition the original matrix. The second strategy solves the first Schur complement matrix using the lower level parts of the RILUM as the preconditioner. We discuss computational and memory costs of both strategies and the potential effect on grid independent convergence rate of RILUM with different implementation strategies.
منابع مشابه
Distributed Schur Complement Techniques for General Sparse Linear Systems
This paper presents a few preconditioning techniques for solving general sparse linear systems on distributed memory environments. These techniques utilize the Schur complement system for deriving the preconditioning matrix in a number of ways. Two of these pre-conditioners consist of an approximate solution process for the global system, which exploit approximate LU factorizations for diagonal...
متن کاملSchur Complement based domain decomposition preconditioners with Low-rank corrections
This paper introduces a robust preconditioner for general sparse symmetric matrices, that is based on low-rank approximations of the Schur complement in a Domain Decomposition (DD) framework. In this “Schur Low Rank” (SLR) preconditioning approach, the coefficient matrix is first decoupled by DD, and then a low-rank correction is exploited to compute an approximate inverse of the Schur compleme...
متن کاملA Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains
This paper considers an algebraic preconditioning algorithm for hyperbolicelliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of tr...
متن کاملOn Domain Decomposition Preconditioning in the Hierarchical P-version of the Nite Element Method
The p-version nite element method for linear, second order elliptic equations in an arbitrary, suuciently smooth domain is studied in the framework of the Domain Decomposition (DD) method. Two types of square reference elements are used with the products of the integrated Legendre polynomials for coordinate functions. Estimates for the condition numbers are given, preconditioning of the problem...
متن کاملApproximate cyclic reduction preconditioning
We discuss an iterative method for solving large sparse systems of equations. A hybrid method is introduced which uses ideas both from ILU preconditioning and from multigrid. The resulting preconditioning technique requires the matrix only. A multilevel structure is obtained by using maximal independent sets for graph coarsening. Ideas from [20], [22] are used to construct a sparse Schur comple...
متن کامل